Some new algorithms for solving mixed equilibrium problems
نویسندگان
چکیده
منابع مشابه
Some Methods for Solving Quasi-Equilibrium Problems
Let X be a given nonempty closed convex subset in IR and let f : X×X −→ IR be a given bifunction with f(x, x) = 0 for all x ∈ X. We are interested in the following quasi-equilibrium problem { Find x ∈ K(x) such that f(x, y) ≥ 0 ∀ y ∈ K(x) (QEP ) where K(·) is a multivalued mapping X −→ 2 . When the mapping x −→ K(x) is such that K(x) = X for all x ∈ X, (QEP ) reduces naturally to the equilibriu...
متن کاملSome Iterative Methods for Solving Equilibrium Problems and Optimization Problems
We introduce a new iterative scheme for finding a common element of the set of solutions of the equilibrium problems, the set of solutions of variational inequality for a relaxed cocoercive mapping, and the set of fixed points of a nonexpansive mapping. The results presented in this paper extend and improve some recent results of Ceng and Yao 2008 , Yao 2007 , S. Takahashi andW. Takahashi 2007 ...
متن کاملAlgorithm of Solutions for Solving Generalized Mixed Implicit Equilibrium Problems
A new system of generalized mixed implicit equilibrium problems is introduced and studied in real reflexive Banach space. A system of generalized equation problems is considered and its equivalence with the system of generalized mixed implicit equilibrium problems is shown. The iterative algorithm of the solutions is constructed and analyzed through a fixed point formulation of the generalized ...
متن کاملPredictor-corrector algorithms for solving generalized mixed implicit quasi-equilibrium problems
A new class of generalized mixed implicit quasi-equilibrium problems (GMIQEP) with four-functions is introduced and studied. The new class of equilibrium problems includes many known generalized equilibrium problems and generalized mixed implicit quasi-variational inequality problems as many special cases. By employing the auxiliary principle technique, some predictor-corrector iterative algori...
متن کاملNew Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP)
Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution. The Generalized Traveling Salesman Problem (GTSP)expands the TSP to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2010
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2010.06.016